Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("VOLKMANN, Lutz")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 47

  • Page / 2
Export

Selection :

  • and

Hamiltonian paths containing a given arc, in almost regular bipartite tournamentsVOLKMANN, Lutz.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 359-364, issn 0012-365X, 6 p.Article

Cycles in multipartite tournaments: results and problemsVOLKMANN, Lutz.Discrete mathematics. 2002, Vol 245, Num 1-3, pp 19-53, issn 0012-365XArticle

Upper bounds on the signed total domatic number of graphsVOLKMANN, Lutz.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 832-837, issn 0166-218X, 6 p.Article

Multipartite tournaments : A surveyVOLKMANN, Lutz.Discrete mathematics. 2007, Vol 307, Num 24, pp 3097-3129, issn 0012-365X, 33 p.Article

Longest cycles in almost regular 3-partite tournamentsVOLKMANN, Lutz.Discrete mathematics. 2006, Vol 306, Num 22, pp 2931-2942, issn 0012-365X, 12 p.Article

Bounds on the signed domatic numberVOLKMANN, Lutz.Applied mathematics letters. 2011, Vol 24, Num 2, pp 196-198, issn 0893-9659, 3 p.Article

Local-edge-connectivity in digraphs and oriented graphsVOLKMANN, Lutz.Discrete mathematics. 2007, Vol 307, Num 24, pp 3207-3212, issn 0012-365X, 6 p.Article

Degree sequence conditions for maximally edge-connected oriented graphsVOLKMANN, Lutz.Applied mathematics letters. 2006, Vol 19, Num 11, pp 1255-1260, issn 0893-9659, 6 p.Article

On cycles in regular 3-partite tournamentsVOLKMANN, Lutz.Discrete mathematics. 2006, Vol 306, Num 12, pp 1198-1206, issn 0012-365X, 9 p.Article

On the connectivity of p-diamond-free graphsHOLTKAMP, Andreas; VOLKMANN, Lutz.Discrete mathematics. 2009, Vol 309, Num 20, pp 6065-6069, issn 0012-365X, 5 p.Article

Parity and disparity subgraphsMCKEE, Terry A; VOLKMANN, Lutz.Discrete mathematics. 2009, Vol 309, Num 8, pp 2608-2612, issn 0012-365X, 5 p.Article

Paths with a given number of vertices from each partite set in regular multipartite tournamentsVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2006, Vol 306, Num 21, pp 2724-2732, issn 0012-365X, 9 p.Article

Almost regular multipartite tournaments containing a Hamiltonian path through a given arcVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 267-278, issn 0012-365X, 12 p.Article

Cycles through a given arc and certain partite sets in almost regular multipartite tournamentsVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2004, Vol 283, Num 1-3, pp 217-229, issn 0012-365X, 13 p.Article

Independent domination and matchings in graphsRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 325-330, issn 0012-365X, 6 p.Article

Maximally edge-connected and vertex-connected graphs and digraphs : A surveyHELLWIG, Angelika; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 15, pp 3265-3296, issn 0012-365X, 32 p.Article

On graphs with equal domination and 2-domination numbersHANSBERG, Adriana; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 11, pp 2277-2281, issn 0012-365X, 5 p.Article

Some remarks on λp,q-connectednessRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 23, pp 5562-5569, issn 0012-365X, 8 p.Article

New bounds on the k-domination number and the k-tuple domination numberRAUTENBACH, Dieter; VOLKMANN, Lutz.Applied mathematics letters. 2007, Vol 20, Num 1, pp 98-102, issn 0893-9659, 5 p.Article

Lower bounds on the vertex-connectivity of digraphs and graphsHELLWIG, Angelika; VOLKMANN, Lutz.Information processing letters. 2006, Vol 99, Num 2, pp 41-46, issn 0020-0190, 6 p.Article

Every cycle-connected multipartite tournament has a universal arcVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2009, Vol 309, Num 4, pp 1013-1017, issn 0012-365X, 5 p.Article

Minimum size of a graph or digraph of given radiusDANKELMANN, Peter; VOLKMANN, Lutz.Information processing letters. 2009, Vol 109, Num 16, pp 971-973, issn 0020-0190, 3 p.Article

On the existence of edge cuts leaving several large componentsRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2009, Vol 309, Num 6, pp 1703-1707, issn 0012-365X, 5 p.Article

All 2-connected in-tournaments that are cycle complementaryMEIERLING, Dirk; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 11, pp 2115-2133, issn 0012-365X, 19 p.Article

Vertex 6-pancyclic in-tournamentsPETERS, Christian; VOLKMANN, Lutz.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 227-238, issn 0012-365X, 12 p.Article

  • Page / 2